UCT Enhancements in Chinese Checkers Using an Endgame Database
نویسندگان
چکیده
The UCT algorithm has gained popularity for use in AI for games, especially in board games. This paper assess the performance of UCT-based AIs and the effectiveness of augmenting them with a lookup table containing evaluations of games states in the game of Chinese Checkers. Our lookup table is only guaranteed to be correct during the endgame, but serves as an accurate heuristic throughout the game. Experiments show that using the lookup table only for its endgames is harmful, while using it for its heuristic values improves the quality of play. This work is performed on a board with 81 locations and 6 pieces, which is larger than previous work on lookup tables in Chinese Checkers. It is a precursor to using the 500GB full-game single-agent data on the full-size board with 81 locations and 10 pieces.
منابع مشابه
The 7-piece Perfect Play Lookup Database for the Game of Checkers
Many research teams and individuals have computed endgame databases for the game of chess which use the distance-to-mate metric, enabling their software to forecast the number of moves remaining until the game is over. This is not the case for the game of checkers. Only one programming team has generated a checkers database capable of announcing the distance to the terminal position. This paper...
متن کاملEnsemble Evolution of Checkers Players with Knowledge of Opening, Middle and Endgame
In this paper, we argue that the insertion of domain knowledge into ensemble of diverse evolutionary checkers can produce improved strategies and reduce evolution time by restricting search space. The evolutionary approach for game is different from the traditional one that exploits knowledge of the opening, middle, and endgame stages, so that it is not sometimes efficient to evolve simple heur...
متن کاملPartial Information Endgame Databases
Endgame databases have previously been built based on complete analysis of endgame positions. In the domain of Checkers, where endgame databases consisting of 39 trillion positions have already been built, it would be beneficial to be able to build select portions of even larger databases, without fully computing portions of the database that will almost never be needed. We present a new win-lo...
متن کاملSymbolic Classification of General Two-Player Games
In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player games with general rewards according to the Game Description Language. We will show that it classifies all states using a linear number of images concerning the depth of the game graph. We also present an extension that uses this ...
متن کامل